Search results for "Hidden Markov models"
showing 10 items of 14 documents
Textual data compression in computational biology: Algorithmic techniques
2012
Abstract In a recent review [R. Giancarlo, D. Scaturro, F. Utro, Textual data compression in computational biology: a synopsis, Bioinformatics 25 (2009) 1575–1586] the first systematic organization and presentation of the impact of textual data compression for the analysis of biological data has been given. Its main focus was on a systematic presentation of the key areas of bioinformatics and computational biology where compression has been used together with a technical presentation of how well-known notions from information theory have been adapted to successfully work on biological data. Rather surprisingly, the use of data compression is pervasive in computational biology. Starting from…
Dynamic Community Detection for Brain Functional Networks during Music Listening with Block Component Analysis
2023
Publisher Copyright: Author The human brain can be described as a complex network of functional connections between distinct regions, referred to as the brain functional network. Recent studies show that the functional network is a dynamic process and its community structure evolves with time during continuous task performance. Consequently, it is important for the understanding of the human brain to develop dynamic community detection techniques for such time-varying functional networks. Here, we propose a temporal clustering framework based on a set of network generative models and surprisingly it can be linked to Block Component Analysis to detect and track the latent community structure…
Cartels Uncovered
2018
How many cartels are there? The answer is important in assessing the efficiency of competition policy. We present a Hidden Markov Model that answers the question, taking into account that often we do not know whether a cartel exists in an industry or not. Our model identifies key policy parameters from data generated under different competition policy regimes and may be used with time-series or panel data. We take the model to data from a period of legal cartels - Finnish manufacturing industries 1951 - 1990. Our estimates suggest that by the end of the period, almost all industries were cartelized.
Real-Time Assembly Support System with Hidden Markov Model and Hybrid Extensions
2022
This paper presents a context-aware adaptive assembly assistance system meant to support factory workers by embedding predictive capabilities. The research is focused on the predictor which suggests the next assembly step. Hidden Markov models are analyzed for this purpose. Several prediction methods have been previously evaluated and the prediction by partial matching, which was the most efficient, is considered in this work as a component of a hybrid model together with an optimally configured hidden Markov model. The experimental results show that the hidden Markov model is a viable choice to predict the next assembly step, whereas the hybrid predictor is even better, outperforming in so…
CArDIS : A Swedish Historical Handwritten Character and Word Dataset
2022
This paper introduces a new publicly available image-based Swedish historical handwritten character and word dataset named Character Arkiv Digital Sweden (CArDIS) (https://cardisdataset.github.io/CARDIS/). The samples in CArDIS are collected from 64, 084 Swedish historical documents written by several anonymous priests between 1800 and 1900. The dataset contains 116, 000 Swedish alphabet images in RGB color space with 29 classes, whereas the word dataset contains 30, 000 image samples of ten popular Swedish names as well as 1, 000 region names in Sweden. To examine the performance of different machine learning classifiers on CArDIS dataset, three different experiments are conducted. In the …
Learning From Errors: Detecting Cross-Technology Interference in WiFi Networks
2018
In this paper, we show that inter-technology interference can be recognized using commodity WiFi devices by monitoring the statistics of receiver errors. Indeed, while for WiFi standard frames the error probability varies during the frame reception in different frame fields (PHY, MAC headers, and payloads) protected with heterogeneous coding, errors may appear randomly at any point during the time the demodulator is trying to receive an exogenous interfering signal. We thus detect and identify cross-technology interference on off-the-shelf WiFi cards by monitoring the sequence of receiver errors (bad PLCP, bad FCS, invalid headers, etc.) and propose two methods to recognize the source of in…
Minimum Description Length Based Hidden Markov Model Clustering for Life Sequence Analysis
2010
In this article, a model-based method for clustering life sequences is suggested. In the social sciences, model-free clustering methods are often used in order to find typical life sequences. The suggested method, which is based on hidden Markov models, provides principled probabilistic ranking of candidate clusterings for choosing the best solution. After presenting the principle of the method and algorithm, the method is tested with real life data, where it finds eight descriptive clusters with clear probabilistic structures. nonPeerReviewed
Statistical identification with hidden Markov models of large order splitting strategies in an equity market
2010
Large trades in a financial market are usually split into smaller parts and traded incrementally over extended periods of time. We address these large trades as hidden orders. In order to identify and characterize hidden orders we fit hidden Markov models to the time series of the sign of the tick by tick inventory variation of market members of the Spanish Stock Exchange. Our methodology probabilistically detects trading sequences, which are characterized by a net majority of buy or sell transactions. We interpret these patches of sequential buying or selling transactions as proxies of the traded hidden orders. We find that the time, volume and number of transactions size distributions of …
An Innovative Statistical Tool for Automatic OWL-ERD Alignment
2016
Aligning two representations of the same domain with different expressiveness is a crucial topic in nowadays semantic web and big data research. OWL ontologies and Entity Relation Diagrams are the most widespread representations whose alignment allows for semantic data access via ontology interface, and ontology storing techniques. The term ""alignment" encompasses three different processes: OWL-to-ERD and ERD-to-OWL transformation, and OWL-ERD mapping. In this paper an innovative statistical tool is presented to accomplish all the three aspects of the alignment. The main idea relies on the use of a HMM to estimate the most likely ERD sentence that is stated in a suitable grammar, and corre…
Analysis of clickstream data with mixture hidden markov models
2021
clickstream data sono un’importante fonte di informazioni per l’ecommerce, sebbene non siano semplici da gestire e convertire queste informazioni in un reale vantaggio competitivo non e un compito banale. In questo articolo, consid- ` eriamo l’applicazione dei mixture hidden Markov model a dati relativi al flusso di clickstream estratti dal portale e-commerce di un’azienda di servizi turistici. Sono stati individuati cluster relativi al comportamento di navigazione degli utenti e alla loro posizione geografica che forniscono indicazioni importanti per lo sviluppo di nuove strategie di business. Clickstream data is an important source of information for businesses, however it is not easy to …